## Uses of Class
oracle.pgx.api.VertexSet

- Packages that use VertexSet
  Package | Description
  --- | ---
  oracle.pgx.api | This package contains the Java APIs of PGX.

- - ### Uses of VertexSet in oracle.pgx.api

    Methods in oracle.pgx.api that return VertexSet
    Modifier and Type | Method and Description
    --- | ---
    `<E extends Comparable<E>> VertexSet<E>` | PgxGraph.`createVertexSet()` Blocking version of `PgxGraph.createVertexSetAsync()`.
    `<E extends Comparable<E>> VertexSet<E>` | PgxGraph.`createVertexSet(String name)` Blocking version of `PgxGraph.createVertexSetAsync()`.
    `<E extends Comparable<E>> VertexSet<E>` | PgxGraph.`getVertices(VertexFilter filter)` Blocking version of `#getVerticesAsync()`.

    Methods in oracle.pgx.api that return types with arguments of type VertexSet
    Modifier and Type | Method and Description
    --- | ---
    `<E extends Comparable<E>> PgxFuture<VertexSet<E>>` | PgxGraph.`createVertexSetAsync()` Creates a new Vertex Set.
    `<E extends Comparable<E>> PgxFuture<VertexSet<E>>` | PgxGraph.`createVertexSetAsync(String name)` Creates a new Vertex Set.
    `<E extends Comparable<E>> PgxFuture<VertexSet<E>>` | PgxGraph.`getVerticesAsync(VertexFilter filter)` Creates a new Vertex Set containing vertices according to the given filter expression.

    Methods in oracle.pgx.api with parameters of type VertexSet
    Modifier and Type | Method and Description
    --- | ---
    `BipartiteGraph` | PgxGraph.`bipartiteSubGraphFromLeftSet(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName)` Blocking version of `#bipartiteSubGraphFromLeftSetAsync()`.
    `BipartiteGraph` | PgxGraph.`bipartiteSubGraphFromLeftSet(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName, String isLeftPropName)` Blocking version of `#bipartiteSubGraphFromLeftSetAsync()`.
    `BipartiteGraph` | PgxGraph.`bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet)` Blocking version of `#bipartiteSubGraphFromLeftSetAsync()`.
    `BipartiteGraph` | PgxGraph.`bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet, String newGraphName)` Blocking version of `#bipartiteSubGraphFromLeftSetAsync()`.
    `PgxFuture<BipartiteGraph>` | PgxGraph.`bipartiteSubGraphFromLeftSetAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName)` Create a bipartite version of a graph.
    `PgxFuture<BipartiteGraph>` | PgxGraph.`bipartiteSubGraphFromLeftSetAsync(Collection<VertexProperty<?,?>> vertexProps, Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, String newGraphName, String isLeftPropName)`
    `PgxFuture<BipartiteGraph>` | PgxGraph.`bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet)` Create a bipartite version of a graph. `#bipartiteSubGraphFromLeftSet(Collection, Collection, VertexSet)` Passing vertexProps as `VertexProperty.ALL` edgeProps as `EdgeProperty.ALL`
    `PgxFuture<BipartiteGraph>` | PgxGraph.`bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet, String newGraphName)` Create a bipartite version of a graph.
    `<ID extends Comparable<ID>> VertexProperty<ID,Double>` | Analyst.`personalizedPagerank(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)` Blocking version of `Analyst.personalizedPagerankAsync(PgxGraph, VertexSet, double, double, int)`.
    `<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>` | Analyst.`personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max)` Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given set of vertices.

Copyright © 2015. All rights reserved.